On the rigidity of regular bicycle (n, k)-gons

نویسنده

  • Balázs Csikós
چکیده

Bicycle (n, k)-gons are equilateral n-gons whose k-diagonals are equal. In this paper, the order of infinitesimal flexibility of the regular n-gon within the family of bicycle (n, k)-gons is studied. An equation characterizing first order flexible regular bicycle (n, k)-gons were computed by S. Tabachnikov in [7]. This equation was solved by R. Connelly and the author in [3]. S. Tabachnikov has also constructed nontrivial deformations of the regular bicycle (n, k)-gon for certain pairs (n, k). The main result of the paper is that if the regular bicycle (n, k)-gon is first order flexible, but is not among Tabachnikov’s examples of deformable regular bicycle (n, k)-gons, then this bicycle polygon is second order flexible as well; however, it is third order rigid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tire track geometry: variations on a theme

We study closed smooth convex plane curves Γ enjoying the following property: a pair of points x, y can traverse Γ so that the distances between x and y along the curve and in the ambient plane do not change; such curves are called bicycle curves. Motivation for this study comes from the problem how to determine the direction of the bicycle motion by the tire tracks of the bicycle wheels; bicyc...

متن کامل

Enumeration of generalized polyominoes

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular k-gons. For n ≤ 4 we determine formulas for the number ak(n) of generalized polyominoes consisting of n regular k-gons. Additionally we give a table of the numbers ak(n) for small k and n obtained by computer enumeration. We finish with some open problems for k-polyominoes.

متن کامل

On the Linear Extension Complexity of Regular n-gons

In this paper, we propose a new upper bound on the linear extension complexity of regular n-gons. It is based on the equivalence between the computation of (i) an extended formulation of size r of a polytope P , and (ii) a rank-r nonnegative factorization of a slack matrix of the polytope P . We provide explicit nonnegative factorizations for the slack matrix of any regular n-gons of size 2⌈log...

متن کامل

Classification of First-order Flexible Regular Bicycle Polygons

A bicycle (n, k)-gon is an equilateral n-gon whose k-diagonals are equal. S. Tabachnikov proved that a regular n-gon is first-order flexible as a bicycle (n, k)-gon if and only if there is an integer 2 ≤ r ≤ n − 2 such that tan(π/n) tan(krπ/n) = tan(kπ/n) tan(rπ/n). In the present paper, we solve this trigonometric diophantine equation. In particular, we describe the family of first order flexi...

متن کامل

On Isosceles Triangles and Related Problems in a Convex Polygon

Given any convex n-gon, in this article, we: (i) prove that its vertices can form at most n2/2 + Θ(n log n) isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture that its vertices can form at most 3n2/4 + o(n2) isosceles triangles and prove this conjecture for a special group of convex n-gons, (iii) prove that its vertices can f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2007